A characterization of 2-tree probe interval graphs
نویسندگان
چکیده
منابع مشابه
A characterization of 2-tree probe interval graphs
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P . We characterize the 2-trees which are probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by ...
متن کامل2-Tree probe interval graphs have a large obstruction set
Probe interval graphs (PIGs) are used as a generalization of interval graphs in physical mapping of DNA.G= (V ,E) is a probe interval graph (PIG) with respect to a partition (P,N) ofV if vertices of G correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is in P; vertices belonging to P are called pro...
متن کامل-tree probe interval graphs have a large obstruction set
Probe interval graphs are used as a generalization of interval graphs in physical mapping of DNA. is a probe interval graph (PIG) with respect to a partition of if vertices of correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is in ; vertices belonging to are called probes and vertices belonging t...
متن کاملTree Spanners for Bipartite Graphs and Probe Interval Graphs1
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner problem asks whether a graph admits a tree t-spanner, given t . We first substantially strengthen the known results for bipartite graphs. We prove that the tree t-spanner problem is NP-complete even for chordal bipartite gr...
متن کاملForbidden subgraph characterization of bipartite unit probe interval graphs
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of the vertices is a probe. When all intervals have the same length (or equivalently, no interval contains another properly) the graph is a unit probe in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2014
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1754